Formula for the Required Capacity of anATM

This contribution deals with a formula for the capacity an ATM multiplexer must at least have to accomodate the loss probability demands of all connections. So it can be used for connection admission control as well as for network resource management purposes. The formula is based on the buuerless uid ow multiplexer model. It allows for a more exact capacity evaluation than if equivalent bandwidths are used on a per-connection basis. On the other hand, it merely requires a computational eeort which is comparable to evaluating the mean of a given distribution. Indeed, the bottleneck is the convolution of probability density functions, on which the formula operates. Two steps to reduce the computational eeort are proposed: a framework for convolution operations, consisting of pre-computed probability density functions, and a suitable truncation of the state space.